What kind of “complexity” is dual to holographic complexity?

نویسندگان

چکیده

Abstract It is assumed that the holographic complexities such as complexity-action (CA) and complexity-volume (CV) conjecture are dual to complexity in field theory. However, because definition of theory still not complete, confirmation duality ambiguous. To improve this situation, we approach problem from a different angle. We first identify minimal genuin properties filed should satisfy without assuming anything circuit or information Based on these properties, propose formula complexity. Our implies between certain states two dimensional CFTs given by Liouville action, which compatible with path-integral gives natural interpretations for both CA CV conjectures what their reference are. When applied thermo-field double states, it also consistent results conjecture: divergent term finite term.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...

15 صفحه اول

What is complexity?

Arguments for or against a trend in the evolution of complexity are weakened by the lack of an unambiguous definition of complexity. Such definitions abound for both dynamical systems and biological organisms, but have drawbacks of either a conceptual or a practical nature. Physical complexity, a measure based on automata theory and information theory, is a simple and intuitive measure of the a...

متن کامل

A new kind of complexity

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that instances are easy to compute but if input to the function is vague the description of a function is exponentially complex. This property puts a new light on...

متن کامل

What is Complexity ? - The philosophy of complexity per

It is argued that complexity has only a limited use as a paradigm against reductionist approaches and that it has a much richer potential as a comparable property. What can complexity be usefully said to be a property of is discussed. It is argued that it is unlikely to have any useful value as applied to “real” objects or systems. Further that even relativising it to an observer has problems. ...

متن کامل

What is complexity science, really

The need for a special issue of Emergence on the question “What is complexity science?” is disturbing on several levels. At one level, one could be forgiven for thinking that the voluminous literature generated in recent years on chaos and complexity theory must contain a clear exposition on the definition, mission, and scope of complexity science. That this exposition has not been forthcoming,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Physical Journal C

سال: 2022

ISSN: ['1434-6044', '1434-6052']

DOI: https://doi.org/10.1140/epjc/s10052-022-10151-0